Efficient convexity and domination algorithms for fine- and medium-grain hypercube computers
نویسندگان
چکیده
منابع مشابه
Hypo-efficient domination and hypo-unique domination
For a graph $G$ let $gamma (G)$ be its domination number. We define a graph G to be (i) a hypo-efficient domination graph (or a hypo-$mathcal{ED}$ graph) if $G$ has no efficient dominating set (EDS) but every graph formed by removing a single vertex from $G$ has at least one EDS, and (ii) a hypo-unique domination graph (a hypo-$mathcal{UD}$ graph) if $G$ has at least two minimum dominating sets...
متن کاملEfficient and Reusable Implementation of Fine-Grain Multithreading and Garbage Collection on Distributed-Memory Parallel Computers
This thesis studies e cient runtime systems for parallelism management (multithreading) and memory management (garbage collection) on largescale distributed-memory parallel computers. Both are fundamental primitives for implementing high-level parallel programming languages that support dynamic parallelism and dynamic data structures. A distinguishing feature of the developed multithreading sys...
متن کاملSpecial Issue on Algorithms for Hypercube Computers. Guest Editor's Introduction
Hypercube computers are of significant commercial and theoretical interest. A survey of this and other journals shows many recent articles dealing with hypercube computers, and the participation in the Conference on Hypercube Concurrent Computers (which has been renamed the Distributed Memory Computing Conference) has continued to rapidly expand. Because of this interest, the time is appropriat...
متن کاملFilaments: Efficient Support for Fine-Grain Parallelism
It has long been thought that coarse-grain parallelism is much more efficient than fine-grain parallelism due to the overhead of process (thread) creation, context switching, and synchronization. On the other hand, there are several advantages to fine-grain parallelism: architecture independence, ease of programming, ease of use as a target for code generation, and load-balancing potential. Thi...
متن کاملhypo-efficient domination and hypo-unique domination
for a graph $g$ let $gamma (g)$ be its domination number. we define a graph g to be (i) a hypo-efficient domination graph (or a hypo-$mathcal{ed}$ graph) if $g$ has no efficient dominating set (eds) but every graph formed by removing a single vertex from $g$ has at least one eds, and (ii) a hypo-unique domination graph (a hypo-$mathcal{ud}$ graph) if $g$ has at least two minimum dominating sets...
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
ژورنال
عنوان ژورنال: Algorithmica
سال: 1992
ISSN: 0178-4617,1432-0541
DOI: 10.1007/bf01758751